Summary:
This paper presents an optimization based algorithm to solve the weekly scheduling problem of a large-scale hydrothermal power system, formulated as a mixed-integer linear programming model (MILP). The main drawback of the MILP approach is the high computational burden required to solve large-size problems. The proposed algorithm tackles this problem by providing an initial feasible and integer solution, which enhances the search of the Branch and Bound (B&B) over the space of feasible solutions, reducing the resolution time. A detailed representation of thermal, pumped storage, and hydroelectric units is considered, taking into account the net head dependence of hydro plants by means of an underrelaxed iterative process. The presented algorithm has been applied to real-scale study cases, obtaining satisfactory results in computational time and optimality.
Keywords: Large-scale hydrothermal scheduling; Head dependent reservoirs; Mixed-integer linear programming
JCR Impact Factor and WoS quartile: 0,232 (2006); 5,000 - Q1 (2023)
DOI reference:
https://doi.org/10.1016/j.ijepes.2005.12.008
Published on paper: June 2006.
Published on-line: March 2006.
Citation:
E. Parrilla, J. García-González, Improving the B&B search for large-scale hydrothermal weekly scheduling problems. International Journal of Electrical Power & Energy Systems. Vol. 28, nº. 5, pp. 339 - 348, June 2006. [Online: March 2006]
